Realizing evaluation strategies by hierarchical graph rewriting
نویسنده
چکیده
We discuss the realization of evaluation strategies for the concurrent constraint-based functional language ccfl within the translation schemata when compiling ccfl programs into the hierarchical graph rewriting language lmntal. The support of lmntal to express local computations and to describe the migration of processes and rules between local computation spaces allows a clear and simple encoding of typical evaluation strategies.
منابع مشابه
Attributed Hierarchical Port Graphs and Applications
We present attributed hierarchical port graphs (AHP) as an extension of port graphs that aims at facilitating the design of modular port graph models for complex systems. AHP consist of a number of interconnected layers, where each layer defines a port graph whose nodes may link to layers further down the hierarchy; attributes are used to store user-defined data as well as visualisation and run...
متن کاملParallel Independence in Hierarchical Graph Transformation
Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps H ⇐ G ⇒ H ′ can be joined by subsequent transformation sequences H ∗ ⇒ M ∗ ⇐ ...
متن کاملEfficient Implementation of Evaluation Strategies via Token-Guided Graph Rewriting
In implementing evaluation strategies of the lambda-calculus, both correctness and efficiency of implementation are valid concerns. While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time efficiency. We contributed to the study of this trade-off by th...
متن کاملShapely Hierarchical Graph Transformation
Diagrams can be represented by graphs, and the animation and transformation of diagrams can be modeled by graph transformation. This paper studies extensions of graphs and graph transformation that are important for programming with graphs: We extend graphs by a notion of hierarchy that supports value composition, and define hierarchical graph transformation in an intuitive way that resembles t...
متن کاملGraph Models for Capital Markets
The financial crisis of 2008 has heightened the need for more effective and transparent tools in the modelling of capital markets. In this paper we propose to use strategic port-graph rewriting (a particular kind of graph transformation system, where port-graph rewriting rules are controlled by user-defined strategies) as a visual modelling tool to analyse credit derivative markets. We illustra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1009.3770 شماره
صفحات -
تاریخ انتشار 2010